WING CHUN AND CHINA’S GRAND STRATEGY

Wing Chun is a martial art that originated three centuries ago in China. Its principles and spirit embody China’s warrior mentality and culture. On the other hand, China’s rising political, economic, and technological revolution is worthy of understanding. It is important to decipher China’s Grand Strategy. There are similarities in culture and style between China’s Grand Strategy and Wing Chun. As a result, China’s Grand Strategy can be defined by five key principles. The first principle is the simplicity of a policy of non-intervention in other countries despite having the power to intervene. The second principle is directness of a national cause, which has the purpose of reasserting territorial interests and reversing what has been known as a century of humiliation. The third principle is China’s practicality in technological innovation in evolving from low-quality products to unparalleled cutting-edge technology that translates in all its instruments of national power. The fourth principle is an economy for international business, which has transformed China’s economic system into a resilient economy that has the best performance in the world despite unpredictable circumstances. Finally, the fifth principle is the minimum use of military force, which has the effect of protecting the nation from external aggression and intimidation. Consequently, countries should decode China’s Grand Strategy if they want to counter or adapt it

Investigation of Solar Hybrid Electric/Thermal System with Radiation Concentrator and Thermoelectric Generator

An experimental study of a solar-concentrating system based on thermoelectric generators (TEGs) was performed. The system included an electrical generating unit with 6 serially connected TEGs using a traditional semiconductor material, Bi2Te3, which was illuminated by concentrated solar radiation on one side and cooled by running water on the other side. A sun-tracking concentrator with a mosaic set of mirrors was used; its orientation towards the sun was achieved with two pairs of radiation sensors, a differential amplifier, and two servomotors. The hot side of the TEGs at midday has a temperature of around 200°C, and the cold side is approximately 50°C. The thermosiphon cooling system was designed to absorb the heat passing through the TEGs and provide optimal working conditions. The system generates 20 W of electrical energy and 200 W of thermal energy stored in water with a temperature of around 50°C. The hybrid system studied can be considered as an alternative to photovoltaic/thermal systems, especially in countries with abundant solar radiation, such as Mexico, China, and India

Solving All-k-Nearest Neighbor Problem without an Index

Among the similarity queries in metric spaces, there are one that obtains the k-nearest neighbors of all the elements in the database (All-k-NN). One way to solve it is the naïve one: comparing each object in the database with all the other ones and returning the k elements nearest to it (k-NN). Another way to do this is by preprocessing the database to build an index, and then searching on this index for the k-NN of each element of the dataset. Answering to the All-k-NN problem allows to build the k-Nearest Neighbor graph (kNNG). Given an object collection of a metric space, the Nearest Neighbor Graph (NNG) associates each node with its closest neighbor under the given metric. If we link each object to their k nearest neighbors, we obtain the k Nearest Neighbor Graph (kNNG).The kNNG can be considered an index for a database, which is quite efficient and can allow improvements. In this work, we propose a new technique to solve the All-k-NN problem which do not use any index to obtain the k-NN of each element. This approach solves the problem avoiding as many comparisons as possible, only comparing some database elements and taking advantage of the distance function properties. Its total cost is significantly lower than that of the naïve solution.XVI Workshop Bases de Datos y Minería de Datos.Red de Universidades con Carreras en Informátic

El principio de seguridad jurídica y la impugnación de sentencias absolutorias

La naturaleza del Principio de Seguridad Jurídica radica en la aplicación correcta de normas previas, claras y que determinen en todo momento el respeto a los Derechos Fundamentales de las personas y su entorno natural, necesarios para la existencia de la raza humana; las distintas ideologías políticas y tendencias sociológicas jurídicas se esforzaron a través de los tiempos en buscar diversos parámetros en que cimentar un sistema de orden legal que evite violentar decisiones judiciales unánimes o mayoritarias en el curso del ordenamiento jurídico del Ecuador, a través de los Tribunales de Garantías Penales de Justicia, no obstante poco se ha logrado respecto a dicho principio que nace como preámbulo de aplicación de la norma; en efecto sin este principio las normas llevarían un desorden en tiempo y espacio, se espera que el artículo 82 de la Constitución de la República del Ecuador, permita garantizar la correcta aplicación de la ley en el tiempo oportuno y con el alcance determinado por el legislador en busca de un ordenamiento preciso conforme la necesidad jurídica dentro de los procesos penales; Para esto, en la última década se han presentados una seria de situaciones y casos judiciales, en el que la seguridad jurídica se ha visto involucrada y violentada, por consiguiente la presente investigación se llevó a cabo la metodología de tipo cuantitativo, cualitativo, de análisis y síntesis y elaboración de encuestas a Jueces de Tribunal de diferentes especialidades, quienes coincidieron con la propuesta de la presente investigación como una forma de impulsar el garantísmo penal en el país

An unbalanced approach to metric space searching

Proximity queries (the searching problem generalized beyond exact match) is mostly modeled as metric space. A metric space consists of a collection of objects and a distance function defined among them. The goal is to preprocess the data set (a slow procedure) to quickly answer proximity queries. This problem have received a lot of attention recently, specially in the pattern recognition community. The Excluded Middle Vantage Point Forest (VP–forest) is a data structure designed to search in high dimensional vector spaces. A VP–forest is built as a collection of balanced Vantage Point Trees (VP–trees). In this work we propose a novel two-fold approach for searching. Firstly we extend the VP– forest to search in metric spaces, and more importantly we test a counterintuitive modification to the VP–tree, namely to unbalance it. In exact searching an unbalanced data structure perform poorly, and most of the algorithmic effort is directed to obtain a balanced data structure. The unbalancing approach is motivated by a recent data structure (the List of Clusters ) specialized in high dimensional metric space searches, which is an extremely unbalanced data structure (a linked list) outperforming other approaches.Eje: AlgoritmosRed de Universidades con Carreras en Informática (RedUNCI

Similarity search with multiple-object queries

Within the topic of similarity search, all work we know assumes that search is based on a dissimilarity space, where a query comprises a single object in the space. Here, we examine the possibility of a multiple-object query. There are at least three circumstances where this is useful. First, a user may be seeking results that are more specific than can be captured by a single query object. For example a query image of a yellow hot-air balloon may return other round, yellow objects, and could be specialised by a query using several hot-air balloon images. Secondly, a user may be seeking results that are more general than can be captured by a single query. For example a query image of a Siamese cat may return only other Siamese cats, and could be generalised by a query using several cats of different types. Finally, a user may be seeking objects that are in more than a single class. For example, for a user seeking images containing both hot-air balloons and cats, a query could comprise a set of images each of which contains one or other of these items, in the hope that the results will contain both. We give an analysis of some different mathematical frameworks which capture the essence of these situations, along with some practical examples in each framework. We report some significant success, but also a number of interesting and unresolved issues. To exemplify the concepts, we restrict our treatment to image embeddings, as they are highly available and the outcomes are visually evident. However the underlying concepts transfer to general search, independent of this domain

A hybrid data structure for searching in metric spaces

The concept of “approximate” searching has applications in a vast number of fields. Some examples are non-traditional databases (e. g. storing images, fingerprints or audio clips, where the concept of exact search is of no use and we search instead for similar objects), text searching, information retrieval, machine learning and classification, image quantization and compression, computational biology, and function prediction.Eje: Base de datosRed de Universidades con Carreras en Informática (RedUNCI